Equitable colorings of corona multiproducts of graphs

A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted χ=(G). It is known that this problem is NP-hard in general case and remains so for corona graphs. In [12] Lin i Chang studied equitable coloring of Cartesian products of graphs. In this paper we consider the same model of coloring in the case of corona products of graphs. In particular, we obtain some results regarding the equitable chromatic number for l-corona product G ◦l H, where G is an equitably 3or 4-colorable graph and H is an r-partite graph, a path, a cycle or a complete graph. Our proofs are constructive in that they lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G. Moreover, we confirm Equitable Coloring Conjecture for corona products of such graphs. This paper extends our results from [8].